Adapting Chart Realization to CCG
نویسندگان
چکیده
We describe a bottom-up chart realization algorithm adapted for use with Combinatory Categorial Grammar (CCG), and show how it can be used to efficiently realize a wide range of coordination phenomena, including argument cluster coordination and gapping. The algorithm has been implemented as an extension to the OpenNLP open source CCG parser. As an avenue for future exploration, we also suggest how the realizer could be used to simplify the treatment of aggregation in conjunction with higher level content planning components.
منابع مشابه
Hypertagging: Supertagging for Surface Realization with CCG
In lexicalized grammatical formalisms, it is possible to separate lexical category assignment from the combinatory processes that make use of such categories, such as parsing and realization. We adapt techniques from supertagging — a relatively recent technique that performs complex lexical tagging before full parsing (Bangalore and Joshi, 1999; Clark, 2002) — for chart realization in OpenCCG, ...
متن کاملAnytime Chart Realization with CCG
We describe an anytime chart realization algorithm for Combinatory Categorial Grammar (CCG) that essentially interleaves the packing and unpacking stages employed in previous hybrid symbolicstatistical approaches. With this algorithm, it becomes possible to use statistical language models both for improving the quality of the output text and for increasing the speed with which it is produced. I...
متن کاملGlue Rules for Robust Chart Realization
This paper shows how glue rules can be used to increase the robustness of statistical chart realization in a manner inspired by dependency realization. Unlike the use of glue rules in MT—but like previous work with XLE on improving robustness with hand-crafted grammars—they are invoked here as a fallback option when no grammatically complete realization can be found. The method works with Combi...
متن کاملEfficient Realization of Coordinate Structures in Combinatory Categorial Grammar
We describe a chart realization algorithm for Combinatory Categorial Grammar (CCG), and show how it can be used to efficiently realize a wide range of coordination phenomena, including argument cluster coordination and gapping. The algorithm incorporates three novel methods for improving the efficiency of chart realization: (i) using rules to chunk the input logical form into sub-problems to be...
متن کاملCCG Chart Realization from Disjunctive Inputs
This paper presents a novel algorithm for efficiently generating paraphrases from disjunctive logical forms. The algorithm is couched in the framework of Combinatory Categorial Grammar (CCG) and has been implemented as an extension to the OpenCCG surface realizer. The algorithm makes use of packed representations similar to those initially proposed by Shemtov (1997), generalizing the approach i...
متن کامل